Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Cloud manufacturing service resource combination optimization model and algorithm under group buying mode
MA Shugang, YANG Jianhua
Journal of Computer Applications    2015, 35 (8): 2147-2152.   DOI: 10.11772/j.issn.1001-9081.2015.08.2147
Abstract408)      PDF (1107KB)(355)       Save

A could manufacturing service resource optimization under group buying mode was proposed in order to reduce service costs of demanders. In the early stage of cloud manufacturing platform, service resource optimization management was analyzed from perspective of service demanders, so as to reduce their service costs of cloud manufacturing platform as a whole. The group buying mode was introduced into the resource combination optimization model, and the key impact factors including pricing and trust level in group buying were considered. Under group buying circumstances, comprehensive decision of cloud manufacturing resource optimization was studied, and an improved genetic algorithm was designed for solving this model. Furthermore, the simulation experiments of different scale problems were also given to verify the validity and feasibility of the proposed model and the improved algorithm. The simulation results show that, when group buying scale increases, group buying mode has more cost advantages.

Reference | Related Articles | Metrics
Foreground detection algorithm based on dynamic threshold kernel density estimation
YANG Dayong, YANG Jianhua, LU Wei
Journal of Computer Applications    2015, 35 (7): 2033-2038.   DOI: 10.11772/j.issn.1001-9081.2015.07.2033
Abstract535)      PDF (971KB)(474)       Save

A new improved Kernel Density Estimation (KDE) algorithm used to segment foreground was proposed for the problem of reciprocating pumps and other troubles for segmenting foreground in the field of Coal Bed Methane (CBM) extraction and poor real-time of KDE. Background Subtraction (BS) and three frame difference were applied to divide the image into dynamic and non-dynamic background regions and then KDE was used to segment foreground for the dynamic background region. A new method of determining dynamic threshold was proposed when segmenting foreground region. Mean absolute deviation over the sample and sample variance were combined to compute the bandwidth. And the strategy of combining regular update with real-time update was used to renew the second background model. Random selection strategy instead of First In First Out (FIFO) mode was applied when replacing samples of the second background model. In the simulation experiments, the average time-consuming of per frame image is reduced by 94.18% and 15.38% and moving objects are more complete when comparing the improved KDE with the KDE and Background Subtraction Kernel Density Estimation (BS-KDE) respectively. The experimental results show that the proposed algorithm can detect foreground in the field of CBM extraction accurately and meet the real-time requirement in the standard definition video surveillance system basically.

Reference | Related Articles | Metrics